Definitional Extension in Type Theory
نویسنده
چکیده
When we extend a type system, the relation between the original system and its extension is an important issue we want to understand. Conservative extension is a traditional relation we study with. But in some cases, like coercive subtyping, it is not strong enough to capture all the properties, more powerful relation between the systems is required. We bring the idea definitional extension from mathematical logic into type theory. In this paper, we study the notion of definitional extension for type theories and explicate its use, both informally and formally, in the context of coercive subtyping. 1998 ACM Subject Classification F.4 Mathematical Logic and Formal Language
منابع مشابه
Theory and implementation of coercive subtyping
Coercive subtyping is a useful and powerful framework of subtyping for type theories. In this thesis, we point out the problem in the old formulation of coercive subtyping in [Luo99], give a new and adequate formulation T [C], the system that extends a type theory T with coercive subtyping based on a set C of basic subtyping judgements, and show that coercive subtyping is a conservative extensi...
متن کاملModel Theory for Process Algebra
We present a first-order extension of the algebraic theory about processes known as ACP and its main models. Useful predicates on processes, such as deadlock freedom and determinism, can be added to this theory through first-order definitional extensions. Model theory is used to analyse the discrepancies between identity in the models of the first-order extension of ACP and bisimilarity of the ...
متن کاملCoercive subtyping: Theory and implementation
Coercive subtyping is a useful and powerful framework of subtyping for type theories. The key idea of coercive subtyping is subtyping as abbreviation. In this paper, we give a new and adequate formulation of T [C], the system that extends a type theory T with coercive subtyping based on a set C of basic subtyping judgements, and show that coercive subtyping is a conservative extension and, in a...
متن کاملA New Type Assignment for Strongly Normalizable Terms
We consider an operator definable in the intuitionistic theory of monadic predicates and we axiomatize some of its properties in a definitional extension of that monadic logic. The axiomatization lends itself to a natural deduction formulation to which the Curry-Howard isomorphism can be applied. The resulting Church style type system has the property that an untyped term is typable if and only...
متن کاملImplementing Application-Specific Object-Oriented Theories in HOL
This paper presents a theory of Object-Oriented concepts embedded shallowly in HOL for the verification of OO analysis models. The theory is application-specific in the sense that it is automatically constructed depending on the type information of the application. This allows objects to have attributes of arbitrary types, making it possible to verify models using not only basic types but also ...
متن کامل